Verisimilitude and belief change for nomic conjunctive theories
نویسندگان
چکیده
منابع مشابه
Belief Revision and Verisimilitude
Belief Revision and Verisimilitude Mark Ryan Department of Mathematics Instituto Superior T ecnico Av. Rovisco Pais 1096 Lisbon Codex Portugal [email protected] Pierre-Yves Schobbens Institut d'Informatique Fac. Univ. Notre-Dame de la Paix Rue Grandgagnage 21 5000 Namur Belgium [email protected] Abstract. The Egli-Milner power-ordering is used to de ne verisimilitude orderings on theories from pr...
متن کاملBelief Revision and Verisimilitude Based on Preference and Truth Orderings
In this rather technical paper we establish a useful combination of belief revision and verisimilitude according to which better theories provide better predictions, and revising with more verisimilar data results in theories that are closer to the truth. Moreover, this paper presents two alternative definitions of refined verisimilitude, which are more perspicuous than the algebraic version us...
متن کاملPoint-free Geometry, Approximate Distances and Verisimilitude of Theories
We propose a metric approach to Popper’s verisimilitude question which is related with point-free geometry. Indeed, we define the theory of approximate metric spaces whose primitive notion are regions, inclusion relation, minimum distance, and maximum distance between regions. Then, we show that the class of possible scientific theories has a structure of approximate metric space. So, we can de...
متن کاملCautious Conjunctive Merging of Belief Functions
When merging belief functions, Dempster rule of combination is justified only when information sources can be considered as independent. When this is not the case, one must find out a cautious merging rule that adds a minimal amount of information to the inputs. Such a rule is said to follow the principle of minimal commitment. Some conditions it should comply with are studied. A cautious mergi...
متن کاملModel-based Algorithm for Belief Revisions between Normal Conjunctive Forms
We consider a knowledge base (KB) K and a new information φ, both expressed in conjunctive form (CF), and present here, a novel, deterministic and correct algorithm for belief revision of φ in K. We denote our revision operator as: K′ = K ◦ φ. We introduce a novel logical binary operator Ind between two conjunctive forms, such that Ind(φ,K) generates also a conjunctive form. The operator Ind(φ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2012
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-012-0165-0